Solving two-stage hybrid flow shop using climbing depth-bounded discrepancy search
نویسندگان
چکیده
منابع مشابه
Solving two-stage hybrid flow shop using climbing depth-bounded discrepancy search
This paper investigates how to adapt a discrepancy-based search method to solve two-stage hybrid flowshop scheduling problems in which each stage consists of several identical machines operating in parallel. The objective is to determine a schedule that minimizes the makespan. We present an adaptation of the Climbing Depth-bounded Discrepancy Search (CDDS) method based on Johnson’s rule and on ...
متن کاملClimbing Depth-Bounded Adjacent Discrepancy Search for Solving Hybrid Flow Shop Scheduling Problems with Multiprocessor Tasks
This paper considers multiprocessor task scheduling in a multistage hybrid flow-shop environment. The problem even in its simplest form is NP-hard in the strong sense. The great deal of interest for this problem, besides its theoretical complexity, is animated by needs of various manufacturing and computing systems. We propose a new approach based on limited discrepancy search to solve the prob...
متن کاملClimbing Depth-Bounded Discrepancy Search for Solving Hybrid Flow Shop Problems
This paper investigates how to adapt some discrepancy-based search methods to solve Hybrid Flow Shop (HFS) problems in which each stage consists of several identical machines operating in parallel. The objective is to determine a schedule that minimizes the makespan. We present here an adaptation of the Depth-bounded Discrepancy Search (DDS) method to obtain near-optimal solutions with makespan...
متن کاملDepth-bounded Discrepancy Search
Many search trees are impractical ly large to explore exhaustively. Recently, techniques like l imi ted discrepancy search have been proposed for improving the chance of f inding a goal in a l imi ted amount of search. Depth-bounded discrepancy search offers such a hope. The motivat ion behind depth-bounded discrepancy search is that branching heuristics are more likely to be wrong at the top o...
متن کاملParallel Depth-Bounded Discrepancy Search
Search strategies such as Limited Discrepancy Search (LDS) and Depth-bounded Discrepancy Search (DDS) find solutions faster than a standard Depth-First Search (DFS) when provided with good valueselection heuristics. We propose a parallelization of DDS: Parallel Depthbounded Discrepancy Search (PDDS). This parallel search strategy has the property to visit the nodes of the search tree in the sam...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Industrial Engineering
سال: 2011
ISSN: 0360-8352
DOI: 10.1016/j.cie.2010.11.015